Paths are Turán-good

نویسندگان

چکیده

Abstract We show that among $$K_{k+1}$$ K k + 1 -free n -vertex graphs, the Turán graph contains most copies of any path.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Turán Numbers for 3-Uniform Linear Paths of Length 3

In this paper we confirm a special, remaining case of a conjecture of Füredi, Jiang, and Seiver, and determine an exact formula for the Turán number ex3(n;P 3 3 ) of the 3-uniform linear path P 3 3 of length 3, valid for all n. It coincides with the analogous formula for the 3-uniform triangle C3 3 , obtained earlier by Frankl and Füredi for n > 75 and Csákány and Kahn for all n. In view of thi...

متن کامل

Turán problems and shadows I: Paths and cycles

A k-path is a hypergraph Pk = {e1, e2, . . . , ek} such that |ei ∩ ej | = 1 if |j − i| = 1 and ei ∩ ej = ∅ otherwise. A k-cycle is a hypergraph Ck = {e1, e2, . . . , ek} obtained from a (k − 1)path {e1, e2, . . . , ek−1} by adding an edge ek that shares one vertex with e1, another vertex with ek−1 and is disjoint from the other edges. Let exr(n,G) be the maximum number of edges in an r-graph wi...

متن کامل

Rainbow Turán Problems for Paths and Forests of Stars

For a fixed graph F , we would like to determine the maximum number of edges in a properly edge-colored graph on n vertices which does not contain a rainbow copy of F , that is, a copy of F all of whose edges receive a different color. This maximum, denoted by ex∗(n, F ), is the rainbow Turán number of F , and its systematic study was initiated by Keevash, Mubayi, Sudakov and Verstraëte [Combin...

متن کامل

Turán Numbers for Forests of Paths in Hypergraphs

The Turán number of an r-uniform hypergraph H is the maximum number of edges in any r-graph on n vertices which does not contain H as a subgraph. Let P denote the family of r-uniform loose paths on edges, F(k, l) denote the family of hypergraphs consisting of k disjoint paths from P , and L (r) denote an r-uniform linear path on edges. We determine precisely exr(n;F(k, l)) and exr(n; k · L ), a...

متن کامل

Growth : Are Good Times Good

The relative status of women is poor in the developing world, compared to developed countries. Increases in per capita income lead to improvements in different measures of gender equality, suggesting that there may be market failures hindering investment in girls in developing countries, and that these are typically overcome as development proceeds. Gender inequality in education and health can...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Graphs and Combinatorics

سال: 2023

ISSN: ['1435-5914', '0911-0119']

DOI: https://doi.org/10.1007/s00373-023-02641-z